<title>矿场搭建</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;bits/stdc++.h&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define LL long long</span>
<span class="pl-cp">#define dob complex&lt;double&gt;</span>
<span class="pl-cp">#define Abs(a) ((a) &lt; 0 ? (-(a)) : (a))</span>
<span class="pl-cp">#define Max(a, b) ((a) &gt; (b) ? (a) : (b))</span>
<span class="pl-cp">#define Min(a, b) ((a) &lt; (b) ? (a) : (b))</span>
<span class="pl-cp">#define Swap(a, b) ((a) ^= (b), (b) ^= (a), (a) ^= (b))</span>
<span class="pl-cp">#define writeln(x) (write(x), putchar(&#39;\n&#39;))</span>
<span class="pl-cp">#define lowbit(x) ((x)&amp;(-(x)))</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">N</span> <span class="pl-o">=</span> <span class="pl-mi">500</span><span class="pl-p">;</span>
<span class="pl-kt">void</span> <span class="pl-nf">read</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-o">&amp;</span><span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-kt">char</span> <span class="pl-n">ch</span><span class="pl-p">;</span> <span class="pl-kt">bool</span> <span class="pl-n">flag</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-n">ch</span> <span class="pl-o">=</span> <span class="pl-n">getchar</span><span class="pl-p">();</span> <span class="pl-o">!</span><span class="pl-n">isdigit</span><span class="pl-p">(</span><span class="pl-n">ch</span><span class="pl-p">)</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-p">((</span><span class="pl-n">flag</span> <span class="pl-o">|=</span> <span class="pl-p">(</span><span class="pl-n">ch</span> <span class="pl-o">==</span> <span class="pl-sc">&#39;-&#39;</span><span class="pl-p">))</span> <span class="pl-o">||</span> <span class="pl-mi">1</span><span class="pl-p">);</span> <span class="pl-n">ch</span> <span class="pl-o">=</span> <span class="pl-n">getchar</span><span class="pl-p">());</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">isdigit</span><span class="pl-p">(</span><span class="pl-n">ch</span><span class="pl-p">);</span> <span class="pl-n">x</span> <span class="pl-o">=</span> <span class="pl-p">(</span><span class="pl-n">x</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">+</span><span class="pl-p">(</span><span class="pl-n">x</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">3</span><span class="pl-p">)</span><span class="pl-o">+</span><span class="pl-n">ch</span><span class="pl-o">-</span><span class="pl-mi">48</span><span class="pl-p">,</span> <span class="pl-n">ch</span> <span class="pl-o">=</span> <span class="pl-n">getchar</span><span class="pl-p">());</span>
    <span class="pl-n">x</span> <span class="pl-o">*=</span> <span class="pl-mi">1</span><span class="pl-o">-</span><span class="pl-mi">2</span><span class="pl-o">*</span><span class="pl-n">flag</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">print</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-p">{</span><span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">&gt;</span> <span class="pl-mi">9</span><span class="pl-p">)</span> <span class="pl-n">print</span><span class="pl-p">(</span><span class="pl-n">x</span><span class="pl-o">/</span><span class="pl-mi">10</span><span class="pl-p">);</span> <span class="pl-n">putchar</span><span class="pl-p">(</span><span class="pl-n">x</span><span class="pl-o">%</span><span class="pl-mi">10</span><span class="pl-o">+</span><span class="pl-mi">48</span><span class="pl-p">);</span> <span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">write</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-p">{</span><span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">&lt;</span> <span class="pl-mi">0</span><span class="pl-p">)</span> <span class="pl-n">putchar</span><span class="pl-p">(</span><span class="pl-sc">&#39;-&#39;</span><span class="pl-p">);</span> <span class="pl-n">print</span><span class="pl-p">(</span><span class="pl-n">Abs</span><span class="pl-p">(</span><span class="pl-n">x</span><span class="pl-p">));</span> <span class="pl-p">}</span>

<span class="pl-kt">int</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">;</span>
<span class="pl-k">struct</span> <span class="pl-n">tt</span> <span class="pl-p">{</span><span class="pl-kt">int</span> <span class="pl-n">to</span><span class="pl-p">,</span> <span class="pl-n">next</span><span class="pl-p">;</span> <span class="pl-p">}</span><span class="pl-n">edge</span><span class="pl-p">[(</span><span class="pl-n">N</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">];</span>
<span class="pl-k">struct</span> <span class="pl-n">Edge</span> <span class="pl-p">{</span><span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">;</span> <span class="pl-p">};</span>
<span class="pl-kt">int</span> <span class="pl-n">path</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">],</span> <span class="pl-n">top</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">],</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">],</span> <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">],</span> <span class="pl-n">cut</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">],</span> <span class="pl-n">bccno</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">],</span> <span class="pl-n">bccnum</span><span class="pl-p">,</span> <span class="pl-n">times</span><span class="pl-p">,</span> <span class="pl-n">cnt</span><span class="pl-p">;</span>
<span class="pl-n">stack</span><span class="pl-o">&lt;</span><span class="pl-n">Edge</span><span class="pl-o">&gt;</span><span class="pl-n">S</span><span class="pl-p">;</span>
<span class="pl-n">vector</span><span class="pl-o">&lt;</span><span class="pl-kt">int</span><span class="pl-o">&gt;</span><span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">];</span>

<span class="pl-kt">void</span> <span class="pl-nf">dfs</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">fa</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-o">++</span><span class="pl-n">times</span><span class="pl-p">;</span> <span class="pl-kt">int</span> <span class="pl-n">ch</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-n">path</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">];</span> <span class="pl-n">i</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">next</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">v</span> <span class="pl-o">=</span> <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">to</span><span class="pl-p">;</span> <span class="pl-n">Edge</span> <span class="pl-n">e</span> <span class="pl-o">=</span> <span class="pl-p">(</span><span class="pl-n">Edge</span><span class="pl-p">){</span><span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">};</span>
    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]</span> <span class="pl-o">==</span> <span class="pl-mi">0</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">S</span><span class="pl-p">.</span><span class="pl-n">push</span><span class="pl-p">(</span><span class="pl-n">e</span><span class="pl-p">);</span> <span class="pl-o">++</span><span class="pl-n">ch</span><span class="pl-p">;</span>
        <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-n">u</span><span class="pl-p">);</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">Min</span><span class="pl-p">(</span><span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]);</span>
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]</span> <span class="pl-o">&gt;=</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">])</span> <span class="pl-p">{</span>
        <span class="pl-n">cut</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-o">++</span><span class="pl-n">cnt</span><span class="pl-p">].</span><span class="pl-n">clear</span><span class="pl-p">();</span>
        <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-nb">true</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-n">Edge</span> <span class="pl-n">w</span> <span class="pl-o">=</span> <span class="pl-n">S</span><span class="pl-p">.</span><span class="pl-n">top</span><span class="pl-p">();</span> <span class="pl-n">S</span><span class="pl-p">.</span><span class="pl-n">pop</span><span class="pl-p">();</span>
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">bccno</span><span class="pl-p">[</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">!=</span> <span class="pl-n">cnt</span><span class="pl-p">)</span> <span class="pl-n">bccno</span><span class="pl-p">[</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">cnt</span><span class="pl-p">,</span> <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">cnt</span><span class="pl-p">].</span><span class="pl-n">push_back</span><span class="pl-p">(</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">u</span><span class="pl-p">);</span>
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">bccno</span><span class="pl-p">[</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">v</span><span class="pl-p">]</span> <span class="pl-o">!=</span> <span class="pl-n">cnt</span><span class="pl-p">)</span> <span class="pl-n">bccno</span><span class="pl-p">[</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">v</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">cnt</span><span class="pl-p">,</span> <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">cnt</span><span class="pl-p">].</span><span class="pl-n">push_back</span><span class="pl-p">(</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">v</span><span class="pl-p">);</span>
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">u</span> <span class="pl-o">==</span> <span class="pl-n">u</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">w</span><span class="pl-p">.</span><span class="pl-n">v</span> <span class="pl-o">==</span> <span class="pl-n">v</span><span class="pl-p">)</span> <span class="pl-k">break</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span><span class="pl-k">else</span> <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">v</span> <span class="pl-o">!=</span> <span class="pl-n">fa</span><span class="pl-p">)</span> <span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">Min</span><span class="pl-p">(</span><span class="pl-n">low</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span> <span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]);</span>
    <span class="pl-p">}</span>
    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">fa</span> <span class="pl-o">==</span> <span class="pl-mi">0</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">ch</span> <span class="pl-o">==</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-n">cut</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">add</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">v</span><span class="pl-p">)</span> <span class="pl-p">{</span><span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-o">++</span><span class="pl-n">top</span><span class="pl-p">].</span><span class="pl-n">to</span> <span class="pl-o">=</span> <span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-n">edge</span><span class="pl-p">[</span><span class="pl-n">top</span><span class="pl-p">].</span><span class="pl-n">next</span> <span class="pl-o">=</span> <span class="pl-n">path</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">],</span> <span class="pl-n">path</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">top</span><span class="pl-p">;</span> <span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">work</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">path</span><span class="pl-p">,</span> <span class="pl-n">top</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">path</span><span class="pl-p">)),</span> <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">dfn</span><span class="pl-p">,</span> <span class="pl-n">times</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">dfn</span><span class="pl-p">));</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">cut</span><span class="pl-p">,</span> <span class="pl-n">cnt</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">cut</span><span class="pl-p">)),</span> <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">vis</span><span class="pl-p">));</span>
    <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">bccno</span><span class="pl-p">,</span> <span class="pl-n">bccnum</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">bccno</span><span class="pl-p">));</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">m</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">read</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-p">),</span> <span class="pl-n">read</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">),</span> <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">u</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">v</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">u</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">),</span> <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-n">u</span><span class="pl-p">);</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">N</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-o">!</span><span class="pl-n">dfn</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">vis</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])</span> <span class="pl-n">dfs</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">);</span>
    <span class="pl-kt">int</span> <span class="pl-n">ans1</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-kt">unsigned</span> <span class="pl-n">LL</span> <span class="pl-n">ans2</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">cnt</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">sz</span> <span class="pl-o">=</span> <span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">size</span><span class="pl-p">(),</span> <span class="pl-n">t</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&lt;</span> <span class="pl-n">sz</span><span class="pl-p">;</span> <span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">cut</span><span class="pl-p">[</span><span class="pl-n">bcc</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]])</span> <span class="pl-o">++</span><span class="pl-n">t</span><span class="pl-p">;</span>
    <span class="pl-n">sz</span> <span class="pl-o">-=</span> <span class="pl-n">t</span><span class="pl-p">;</span>
    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">t</span> <span class="pl-o">==</span> <span class="pl-mi">0</span><span class="pl-p">)</span> <span class="pl-n">ans1</span> <span class="pl-o">+=</span> <span class="pl-mi">2</span><span class="pl-p">,</span> <span class="pl-n">ans2</span> <span class="pl-o">*=</span> <span class="pl-mi">1LL</span><span class="pl-o">*</span><span class="pl-n">sz</span><span class="pl-o">*</span><span class="pl-p">(</span><span class="pl-n">sz</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">)</span><span class="pl-o">/</span><span class="pl-mi">2</span><span class="pl-p">;</span>
    <span class="pl-k">else</span> <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">t</span> <span class="pl-o">==</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-n">ans1</span><span class="pl-o">++</span><span class="pl-p">,</span> <span class="pl-n">ans2</span> <span class="pl-o">*=</span> <span class="pl-n">sz</span><span class="pl-p">;</span>
    <span class="pl-p">}</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d %lld</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">ans1</span><span class="pl-p">,</span> <span class="pl-n">ans2</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">t</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-o">~</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">m</span> <span class="pl-o">!=</span> <span class="pl-mi">0</span><span class="pl-p">)</span>
    <span class="pl-o">++</span><span class="pl-n">t</span><span class="pl-p">,</span> <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;Case %d: &quot;</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-p">),</span> <span class="pl-n">work</span><span class="pl-p">();</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>